Shape-Matching Model Optimization Using Discrete-point Sampling and Feature Salience
نویسندگان
چکیده
The component classification and potential fault region locating in the full-automatic inspection system of a freight train require a computer vision method with the ability of classifying quickly and locating precisely, addressing anti-nonlinear deformations, and being able to perform extensible learning. Inspired by these requirements, this paper specifically optimizes the three elements of a shape-matching model, including the scene map, the shape template, and the matching. Our method uses a discretepoint sampling map (DPSM) as an intermediate representation, to enhance the stability of the scene maps, uses the criterion function based on feature salience to select a better shape-template group, and matches hand-sketches with regions in DPSMs to reduce the difficulty of the matching calculation. Based on our optimized shapematching model, we set up a new procedure for component classifications and potential fault region locating in the fullautomatic inspection system for freight trains, which has been applied successfully on more than 10 parts of freight train cars in the railway for more than 2 years. The results of anti-noise testing in laboratory and daily operation at several inspecting stations show that our method has a strong ability to survive with nonlinear deformations, and has a good extensibility to be used with different parts, which meet application demands for the full-automatic inspection system.
منابع مشابه
Image Perspective Invariant Features Algorithm Based on Particle Swarm Optimization
To solve the problems like affine sampling strategy and sampling point discrete settings etc. of traditional image matching techniques, this paper proposes the image perspective invariant features algorithm based on particle swarm optimization. The algorithm uses the features of the perspective transforming sampling methods to extract the algorithm and uses perspective transforming sampling to ...
متن کاملMatching of Polygon Objects by Optimizing Geometric Criteria
Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....
متن کاملEfficient Aerodynamic Optimization Using a Multiobjective Optimization Based Framework to Balance the Exploration and Exploitation
In many aerospace engineering design problems, objective function evaluations can be extremely computationally expensive, such as the optimal design of the aerodynamic shape of an airfoil using high-fidelity computational fluid dynamics (CFD) simulation. A widely used approach for dealing with expensive optimization is to use cheap global surrogate (approximation) models to substitute expensive...
متن کاملLearning Hypergraph Labeling for Feature Matching
This study poses the feature correspondence problem as a hypergraph node labeling problem. Candidate feature matches and their subsets (usually of size larger than two) are considered to be the nodes and hyperedges of a hypergraph. A hypergraph labeling algorithm, which models the subset-wise interaction by an undirected graphical model, is applied to label the nodes (feature correspondences) a...
متن کاملStructure-oriented contour representation and matching for engineering shapes
Conventional shape matching for engineering models primarily considers rigid shape similarity. They do not seek global shape similarity while considering large local deformations. However, engineering models created by some parametric-based design can involve large parametric changes. As a result, they do not share similarity in their global shape. Hence our goal is to develop shape representat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 9 شماره
صفحات -
تاریخ انتشار 2014